A hybrid multi-population framework for dynamic environments combining online and offline learning

نویسندگان

  • Gonul Uludag
  • Berna Kiraz
  • A. Sima Etaner-Uyar
  • Ender Özcan
چکیده

Population based incremental learning algorithms and selection hyper-heuristics are highly adaptive methods which can handle different types of dynamism that may occur while a given problem is being solved. In this study, we present an approach based on a framework hybridizing these approaches to solve dynamic environment problems. A key feature of this hybrid approach is that it also incorporates online learning, which takes place during the search process for a high quality solution to a given instance, mixing it with offline learning which takes place during the training session prior to dealing with the instance. The performance of the approach along with the influence of different heuristic selection methods used within the selection hyper-heuristic is investigated over a range of dynamic environments produced by a well known benchmark generator. The empirical results show that the proposed approach using a particular hyper-heuristic A preliminary version of this study was presented in UKCI 2012: 12th Annual Workshop on Computational Intelligence Gönül Uludağ and Berna Kiraz Institute of Science and Technology Istanbul Technical University Maslak, Istanbul, Turkey 34469 E-mail: [email protected] E-mail: [email protected] A. Şima Etaner-Uyar Department of Computer Engineering Istanbul Technical University Maslak, Istanbul, Turkey 34469 E-mail: [email protected] Ender Özcan School of Computer Science University of Nottingham Nottingham, UK NG8 1BB E-mail: [email protected] outperforms some of the top approaches in literature for dynamic environment problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Designing collaborative learning model in online learning environments

Introduction: Most online learning environments are challenging for the design of collaborative learning activities to achieve high-level learning skills. Therefore, the purpose of this study was to design and validate a model for collaborative learning in online learning environments. Methods: The research method used in this study was a mixed method, including qualitative content analysis and...

متن کامل

Introducing a new meta-heuristic algorithm based on See-See Partridge Chicks Optimization to solve dynamic optimization problems

The SSPCO (See-See Particle Chicks Optimization) is a type of swarm intelligence algorithm derived from the behavior of See-See Partridge. Although efficiency of this algorithm has been proven for solving static optimization problems, it has not yet been tested to solve dynamic optimization problems. Due to the nature of NP-Hard dynamic problems, this algorithm alone is not able to solve such o...

متن کامل

A Framework to Hybridize PBIL and a Hyper-heuristic for Dynamic Environments

Selection hyper-heuristic methodologies explore the space of heuristics which in turn explore the space of candidate solutions for solving hard computational problems. This study investigates the performance of approaches based on a framework that hybridizes selection hyper-heuristics and population based incremental learning (PBIL), mixing offline and online learning mechanisms for solving dyn...

متن کامل

Chaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments

Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...

متن کامل

A Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems

In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Soft Comput.

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2013